Enumeration formula for (2, n)-cubes in discrete planes
نویسندگان
چکیده
We compute the number of local configurations of size 2×n on naive discrete planes using combinatorics on words, 2-dimensional Rote sequences and Berstel-Pocchiola diagrams.
منابع مشابه
On some applications of generalized functionality for arithmetic discrete planes
Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete planes, by introducing suitable projection directions (α1, α2, α3) satisfying α1v1 +α2v2 +α3v3 = w. Several applications are considered. We first study certain local configurations, that is, the (m,n)-cubes introduced ...
متن کاملOn median nature and enumerative properties of Fibonacci-like cubes
Fibonacci cubes, extended Fibonacci cubes, and Lucas cubes are induced subgraphs of hypercubes 9 defined in terms of Fibonacci strings. It is shown that all these graphs are median. Several enumeration results on the number of their edges and squares are obtained. Some identities involving Fibonacci 11 and Lucas numbers are also presented. © 2005 Published by Elsevier B.V. 13
متن کاملAbout thin arithmetic discrete planes
Arithmetic discrete planes are sets of integer points located within a fixed bounded distance (called thickness) of a Euclidean plane. We focus here on a class of “thin” arithmetic discrete planes, i.e., on a class of arithmetic discrete planes whose thickness is smaller than the usual one, namely the so-called standard one. These thin arithmetic discrete planes have “holes” but we consider a t...
متن کامل(-1)-Enumeration of Self-Complementary Plane Partitions
Abstract. We prove a product formula for the remaining cases of the weighted enumeration of self–complementary plane partitions contained in a given box where adding one half of an orbit of cubes and removing the other half of the orbit changes the sign of the weight. We use nonintersecting lattice path families to express this enumeration as a Pfaffian which can be expressed in terms of the kn...
متن کاملEnumeration of unrooted hypermaps of a given genus
In this paper we derive an enumeration formula for the number of hypermaps of a given genus g and given number of darts n in terms of the numbers of rooted hypermaps of genus γ ≤ g with m darts, where m|n. Explicit expressions for the number of rooted hypermaps of genus g with n darts were derived by Walsh (1975) for g = 0, and by Arques (1987) for g = 1. We apply our general counting formula t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Applied Mathematics
دوره 160 شماره
صفحات -
تاریخ انتشار 2012